Optimizing the Modified Lam Annealing Schedule

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Simulated Annealing Schedule

The popularity of simulated annealing comes from its ability to find close to optimal solutions for NPhard combinatorial optimization problems. Unfortunately, the method has a major drawback: its massive requirement of computation time. In this dissertation, we present an efficient annealing schedule which speeds up simulated annealing by a factor of up to twenty-four when compared with general...

متن کامل

Annealing schedule from population dynamics

Population-based optimization algorithms [1–3] have been successfully applied to problems in physics [4,5] and beyond [6]. This class of algorithms is based on the simultaneous tracking of more than one point in search space (a “population”, in analogy to biological evolution [7]), in order to make trapping in local optima less likely during the process of optimization. In addition, stochastic ...

متن کامل

An Efficient Simulated Annealing Schedule: Derivation

The popularity of simulated annealing comes from its ability to find close to optimal solutions for NP-hard combinatorial optimization problems. Unfortunately, current implementations of the method usually require massive computation time. This paper presents a general annealing schedule which speeds up simulated annealing significantly when compared with general schedules available in the lite...

متن کامل

Schedule (modified 6/25/2012)

S (in alphabetic order by speaker surname) Speaker: Nathan Albin (Kansas State University) Title: Fourier Continuation Methods for Long-Range Propagation and Transport Abstract: The Fourier Continuation (FC) method is a numerical technique for expressing nonperiodic functions as restrictions of rapidly converging Fourier series, thus avoiding the Gibbs phenomenon and enabling the use of Fourier...

متن کامل

Optimizing Test Case Execution Schedule using Classifiers

As software evolves, test suite continually grows larger. However running all the test cases in the test suite is prohibitive in most cases. To reduce the cost of regression testing, we can optimize test case execution schedule to maximize the early fault detection rate of the original test suite. Different from previous research, we use classification algorithms to guide the schedule process b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EAI Endorsed Transactions on Industrial Networks and Intelligent Systems

سال: 2021

ISSN: 2410-0218

DOI: 10.4108/eai.16-12-2020.167653